Complexity of Presuppositions in Local Domain
نویسندگان
چکیده
In this paper we would like to deal with interaction of presupposition triggers and show that the binding theory of presupposition comes up with it better than the satisfaction theory. In section 2, the newly developed presupposition conception is introduced. Section 3 explains the Binding Theory in contrast with the Satisfaction Theory. In sections 4 and 5, Kamp's new idea about the treatment of complex interaction of presuppositions is introduced, and it is suggested that his theory can be extended to two other phenomena; linguistic contexts in which presupposition triggers only have narrow scope reading and specificity interpretation of some Japanese NPs. Based on the recent development of DRT approaches on presuppositions, we will deal with floating quantifiers as a special case of specificity phenomena in sections 6 to 8. In section 6, three different configurations of a quantifier and its restriction NP are introduced: the genitive construction, the compound construction and the floating construction. As a preliminary research, we concentrate in section 7 and 8 on the compound construction of floating quantifiers to the effect that comparison with Semantic Incorporation is made to understand non-specificity of the construction more in detail. This will be done first in GQT terms (section 7) and finally as an application of de Swart & Farkas' theory on weak NPs (section 8).
منابع مشابه
Local Self-concordance of Barrier Functions Based on Kernel-functions
Many efficient interior-point methods (IPMs) are based on the use of a self-concordant barrier function for the domain of the problem that has to be solved. Recently, a wide class of new barrier functions has been introduced in which the functions are not self-concordant, but despite this fact give rise to efficient IPMs. Here, we introduce the notion of locally self-concordant barrier functio...
متن کاملThe role of presuppositions and situations in the interpretation of adverbial quantifiers
This paper describes a method for computing the domain of quantification of an adverbially quantified sentence. This method relies on the accommodation of presuppositions in the scope of a quantificational adverb and on the resolution of the domain in context. Situations form the link between adverbial quantifiers and presuppositions, as adverbial quantifiers are taken to quantify over situatio...
متن کاملPresuppositions and Quantifier Domains
In this paper, I will argue for a new account of presuppositions which is based on double indexing as well as minimal representational contexts providing antecedent material for anaphoric presuppositions, rather than notions of context defined in terms of the interlocutors' pragmatic presuppositions or the information accumulated from the preceding discourse. This account applies in particular ...
متن کاملSecond-Order Statistical Texture Representation of Asphalt Pavement Distress Images Based on Local Binary Pattern in Spatial and Wavelet Domain
Assessment of pavement distresses is one of the important parts of pavement management systems to adopt the most effective road maintenance strategy. In the last decade, extensive studies have been done to develop automated systems for pavement distress processing based on machine vision techniques. One of the most important structural components of computer vision is the feature extraction met...
متن کاملThree dimensional static and dynamic analysis of thick plates by the meshless local Petrov-Galerkin (MLPG) method under different loading conditions
In this paper, three dimensional (3D) static and dynamic analysis of thick plates based on the Meshless Local Petrov-Galerkin (MLPG) is presented. Using the kinematics of a three-dimensional continuum, the local weak form of the equilibrium equations is derived. A weak formulation for the set of governing equations is transformed into local integral equations on local sub-domains by using a uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007